Theta Bodies for Polynomial Ideals
نویسندگان
چکیده
Inspired by a question of Lovász, we introduce a hierarchy of nested semidefinite relaxations of the convex hull of real solutions to an arbitrary polynomial ideal, called theta bodies of the ideal. For the stable set problem in a graph, the first theta body in this hierarchy is exactly Lovász’s theta body of the graph. We prove that theta bodies are, up to closure, a version of Lasserre’s relaxations for real solutions to ideals, and that they can be computed explicitly using combinatorial moment matrices. Theta bodies provide a new canonical set of semidefinite relaxations for the max cut problem. For vanishing ideals of finite point sets, we give several equivalent characterizations of when the first theta body equals the convex hull of the points. We also determine the structure of the first theta body for all ideals.
منابع مشابه
ar X iv : 0 80 9 . 34 80 v 2 [ m at h . O C ] 1 2 Ja n 20 09 THETA BODIES FOR POLYNOMIAL IDEALS
Inspired by a question of Lovász, we introduce a hierarchy of nested semidefinite relaxations of the convex hull of real solutions to an arbitrary polynomial ideal, called theta bodies of the ideal. For the stable set problem in a graph, the first theta body in this hierarchy is exactly Lovász’s theta body of the graph. We prove that theta bodies are, up to closure, a version of Lasserre’s rela...
متن کاملSe p 20 08 THETA BODIES FOR POLYNOMIAL IDEALS
A polynomial ideal I ⊆ R[x] is THk-exact if every linear polynomial that is non-negative over VR(I), the real variety of I , is a sum of squares of polynomials of degree at most k modulo I . Lovász recognized that a graph is perfect if and only if the vanishing ideal of the characteristic vectors of its stable sets is TH1-exact, and asked for a characterization of ideals which are TH1-exact. We...
متن کاملTensor theta norms and low rank recovery
We study extensions of compressive sensing and low rank matrix recovery to the recovery of tensors of low rank from incomplete linear information. While the reconstruction of low rank matrices via nuclear norm minimization is rather well-understand by now, almost no theory is available so far for the extension to higher order tensors due to various theoretical and computational difficulties ari...
متن کاملA new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs
The theta bodies of a polynomial ideal are a series of semidefinite programming relaxations of the convex hull of the real variety of the ideal. In this paper we construct the theta bodies of the vanishing ideal of cycles in a binary matroid. Applied to cuts in graphs, this yields a new hierarchy of semidefinite programming relaxations of the cut polytope of the graph. If the binary matroid avo...
متن کاملCastelnuovo-Mumford regularity of products of monomial ideals
Let $R=k[x_1,x_2,cdots, x_N]$ be a polynomial ring over a field $k$. We prove that for any positive integers $m, n$, $text{reg}(I^mJ^nK)leq mtext{reg}(I)+ntext{reg}(J)+text{reg}(K)$ if $I, J, Ksubseteq R$ are three monomial complete intersections ($I$, $J$, $K$ are not necessarily proper ideals of the polynomial ring $R$), and $I, J$ are of the form $(x_{i_1}^{a_1}, x_{i_2}^{a_2}, cdots, x_{i_l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM Journal on Optimization
دوره 20 شماره
صفحات -
تاریخ انتشار 2010